Enhancing Binary Feature Vector Similarity Measures
نویسندگان
چکیده
منابع مشابه
Image steganalysis with binary similarity measures
We present a novel technique for steganalysis of images that have been subjected to embedding by steganographic algorithms. The seventh and eight bit planes in an image are used for the computation of several binary similarity measures. The basic idea is that, the correlation between the bit planes as well the binary texture characteristics within the bit planes will differ between a stego-imag...
متن کاملLearning Feature Weights for Similarity Measures
When employing a similarity function to measure the similarity between two cases, one large problem is how to determine the feature weights. This paper presents a new method for learning feature weights in a similarity function from the given similarity information. The similarity information can be divided into two kinds: One is called qualitative similarity information which represents the si...
متن کاملVector based Approaches to Semantic Similarity Measures
This paper describes our approach to developing novel vector based measures of semantic similarity between a pair of sentences or utterances. Measures of this nature are useful not only in evaluating machine translation output, but also in other language understanding and information retrieval applications. We first describe the general family of existing vector based approaches to evaluating s...
متن کاملLearning Vector Representations for Similarity Measures
Conventional vector-based similarity measures consider each term separately. In methods such as cosine or overlap, only identical terms occurring in both term vectors are matched and contribute to the final similarity score. Non-identical but semantically related terms, such as “car” and “automobile”, are completely ignored. To address this problem, we propose a novel approach that learns a new...
متن کاملFeature Vector Similarity Based on Local Structure
Local feature matching is an essential component of many image retrieval algorithms. Euclidean and Mahalanobis distances are mostly used in order to compare two feature vectors. The first distance does not give satisfactory results in many cases and is inappropriate in the typical case where the components of the feature vector are incommensurable, whereas the second one requires training data....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pattern Recognition Research
سال: 2006
ISSN: 1558-884X
DOI: 10.13176/11.20